Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
نویسندگان
چکیده
منابع مشابه
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
The Hop-Constrained Minimum Spanning Tree Problem (HMSTP) is a NP-hard problem arising in the design of centralized telecommunication networks with quality of service constraints. We show that the HMSTP is equivalent to a Steiner Tree Problem (STP) in an adequate layered graph. We prove that the directed cut formulation for the STP defined in the layered graph, dominates (in terms of the linear...
متن کاملA New Layered Graph Approach to Hop- and Diameter-constrained Spanning/Steiner Tree Problems in Graphs
In this paper a novel generic way to model hopor diameterconstrained tree problems as integer linear programs is introduced. The concept of layered graphs has gained widespread attention in the last few years, since it exhibits significant computational advantages when compared to previously available extended, but compact, formulations for this type of problems. We derive a new extended formul...
متن کاملDiameter-Constrained Steiner Tree
Given an edge-weighted undirected graph G = (V,E, c, w), where each edge e ∈ E has a cost c(e) and a weight w(e), a set S ⊆ V of terminals and a positive constant D0, we seek a minimum cost Steiner tree where all terminals appear as leaves and its diameter is bounded by D0. Note that the diameter of a tree represents the maximum weight of path connecting two different leaves in the tree. Such p...
متن کاملVariable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
Given an undirected graph whose edges are labeled or colored, edge weights indicating the cost of an edge, and a positive budget B, the goal of the cost constrained minimum label spanning tree (CCMLST) problem is to find a spanning tree that uses the minimum number of labels while ensuring its cost does not exceed B. The label constrained minimum spanning tree (LCMST) problem is closely related...
متن کاملReload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2009
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-009-0297-2